Modeling and analyzing the Trickle algorithm

The Trickle algorithm has been proposed as a suitable protocol for effective and efficient distribution and maintenance of code in wireless sensor networks. In this report we analyze the suitability of the Trickle algorithm for lighting control in terms of its parameter settings. We do this by developing and analyzing mathematical models of the Trickle algorithm assuming interference-free networks and no loss rates. In a single-cell scenario we verify a conjecture about how the expected number of broadcasts per time interval depends on the cell size and the introduction of a listen-only period. Moreover, we give exact expressions for how the expected number of messages per time interval increases with the size of the cell. Furthermore, we show that the results can also be applied to large multi-cell networks. Lastly we investigate how the speed at which the Trickle algorithm can spread a new update across a network depends on the various Trickle parameters and network density. Results are compared with realistic network simulations done in OMNeT++. We find that by setting the Trickle appropriately, our models capture the performance of the Trickle algorithm in realistic settings quite well.